Section: Partnerships and Cooperations

International Initiatives

See https://project.inria.fr/siliconvalley/fr/

Associate Team involved in the International Lab:

• GOAL

  • Title: Geometry and Optimization with ALgebraic methods.

  • International Partner (Institution - Laboratory - Researcher):

    • University of California Berkeley (United States) - Dept. of Mathematics - Bernd Sturmfels

  • Start year: 2015

  • See also: http://www-polsys.lip6.fr/GOAL/index.html

  • Polynomial optimization problems form a subclass of general global optimization problems, which have received a lot of attention from the research community recently; various solution techniques have been designed. One reason for the spectacular success of these methods is the potential impact in many fields: data mining, big data, energy savings, etc. More generally, many areas in mathematics, as well as applications in engineering, biology, statistics, robotics etc. require a deeper understanding of the algebraic structure of their underlying objects.

    A new trend in the polynomial optimization community is the combination of algebraic and numerical methods. Understanding and characterizing the algebraic properties of the objects occurring in numerical algorithms can play an important role in improving the efficiency of exact methods. Moreover, this knowledge can be used to estimate the quality (for example the number of significant digits) of numerical algorithms. In many situations each coordinate of the optimum is an algebraic number. The degree of the minimal polynomials of these algebraic numbers is the Algebraic Degree of the problem. From a methodological point of view, this notion of Algebraic Degree emerges as an important complexity parameter for both numerical and the exact algorithms. However, algebraic systems occurring in applications often have special algebraic structures that deeply influence the geometry of the solution set. Therefore, the (true) algebraic degree could be much less than what is predicted by general worst case bounds (using Bézout bounds, mixed volume, etc.), and would be very worthwhile to understand it more precisely.

    The goal of this proposal is to develop algorithms and mathematical tools to solve geometric and optimization problems through algebraic techniques. As a long-term goal, we plan to develop new software to solve these problems more efficiently. These objectives encompass the challenge of identifying instances of these problems that can be solved in polynomial time with respect to the number of solutions and modeling these problems with polynomial equations.

    The kickoff workshop was held at UC Berkeley in May 2015, see https://math.berkeley.edu/~bernd/GOALworkshop.html .

    Both Carlos Améndola Cerón and Kaies Kubjas visited the team one month through the associated team.

See http://liama.ia.ac.cn/ .

Associate Team involved in the International Lab:

• ECCA

  • Title: Exact/Certifed Computation with Algebraic Systems

  • International Partner (Institution - Laboratory - Researcher):

    • KLMM – Chinese Academy of Sciences, Lihong Zhi.

  • Start year: 2012

  • See also: http://liama.ia.ac.cn/research/liama-projects/current/265-ecca-project-description-and-achievements.html

  • Exact/Certifed Computation with Algebraic Systems (ECCA) is a project run within the LIAMA Consortium as a cooperation project between CNRS/Inria/LIP6, KLMM, SKLOIS and LMIB. The main scientific objective of this project is to study and compute the solutions of nonlinear algebraic systems and their structures and properties with target applications to computational geometry, algebraic cryptanalysis, global optimization, and algebraic biology.